Constructing vectorial Boolean functions with high algebraic immunity based on group decomposition
نویسندگان
چکیده
In this paper, we construct a class of vectorial Boolean functions over F2n with high algebraic immunity based on the decomposition of the multiplicative group of F2n . By viewing F2n as G1G2 ∪ {0} (where G1 and G2 are subgroups of F2n , (#G1,#G2) = 1 and #G1 × #G2 = 2 − 1), we give a generalized description for constructing vectorial Boolean functions with high algebraic immunity. Moreover, when n is even, we provide two special classes of vectorial Boolean functions with high(sometimes optimal) algebraic immunity, one is hyper-bent, and the other is of balancedness and optimal algebraic degree .
منابع مشابه
Constructing $2m$-variable Boolean functions with optimal algebraic immunity based on polar decomposition of $\mathbb{F}_{2^{2m}}^*$
Constructing 2m-variable Boolean functions with optimal algebraic immunity based on decomposition of additive group of the finite field F22m seems to be a promising approach since Tu and Deng’s work. In this paper, we consider the same problem in a new way. Based on polar decomposition of the multiplicative group of F22m , we propose a new construction of Boolean functions with optimal algebrai...
متن کاملConstructing Boolean Functions With Potential Optimal Algebraic Immunity Based on Additive Decompositions of Finite Fields
We propose a general approach to construct cryptographic significant Boolean functions of (r + 1)m variables based on the additive decomposition F2rm × F2m of the finite field F 2(r+1)m , where r is odd and m ≥ 3. A class of unbalanced functions are constructed first via this approach, which coincides with a variant of the unbalanced class of generalized Tu-Deng functions in the case r = 1. Thi...
متن کاملA Method For Generation Of High-Nonlinear S-Boxes Based On Gradient Descent
Criteria based on the analysis of the properties of vectorial Boolean functions for selection of substitutions (S-boxes) for symmetric cryptographic primitives are given. We propose an improved gradient descent method for increasing performance of nonlinear vectorial Boolean functions generation with optimal cryptographic properties. Substitutions are generated by proposed method for the most c...
متن کاملVectorial Boolean functions and linear codes in the context of algebraic attacks
In this paper we study the relationship between vectorial (Boolean) functions and cyclic codes in the context of algebraic attacks. We first derive a direct link between the annihilators of a vectorial function (in univariate form) and certain 2n-ary cyclic codes (which we prove that they are LCD codes) extending results due to Rønjom and Helleseth. The knowledge of the minimum distance of thos...
متن کاملConstructing and Counting Even-Variable Symmetric Boolean Functions with Algebraic Immunity not Less Than $d$
In this paper, we explicitly construct a large class of symmetric Boolean functions on 2k variables with algebraic immunity not less than d, where integer k is given arbitrarily and d is a given suffix of k in binary representation. If let d = k, our constructed functions achieve the maximum algebraic immunity. Remarkably, 22 k⌋+2 symmetric Boolean functions on 2k variables with maximum algebra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2012 شماره
صفحات -
تاریخ انتشار 2012